A distributed memory algorithm for 3-D FFTs
نویسندگان
چکیده
منابع مشابه
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملEfficient Calculations of 3-D FFTs on Spiral Contours
This paper proposes a fast algorithm, called the SpiralFFT, that computes samples of the 3-D discrete Fourier transform of an object of interest along spiral contours in frequency space. This type of sampling geometry is prevalent in 3-D magnetic resonance imaging, as spiral sampling patterns allow for rapid, uninterrupted scanning over a large range of frequencies. We show that parameterizing ...
متن کاملA Distributed Memory Algorithm for Lexicon Building
A parallel algorithm for preparing word frequency concordances over two speci ed sets of documents from a collection is presented. Good parallel e ciency is demonstrated on a 128-node distributed memory machine using sets whose combined size exceeds one gigabyte. It is demonstrated that e ciency is heavily in uenced by hashing and communication strategies. A two-stage hashing algorithm is propo...
متن کاملD - OSC : A SISAL Compiler for Distributed - Memory MachinesDavid
In this paper we present the results of the implementation of D-OSC: a prototype SISAL compiler for distributed-memory machines. The compiler is an extension of the Optimizing SISAL Compiler (OSC) version 12.9.1, it generates C code with calls to the message passing library MPI. The main goals of this implementation are to obtain a SISAL compiler that generates code for distributed-memory machi...
متن کاملCompiler Optimizations for Fortran D on Mimd Distributed-memory Machines Compiler Optimizations for Fortran D on Mimd Distributed-memory Machines
Massively parallel MIMD distributed-memory machines can provide enormous computation power. However, the diiculty of developing parallel programs for these machines has limited their accessibility. This paper presents compiler algorithms to automatically derive eecient message-passing programs based on data decompositions. Optimizations are presented to minimize load imbalance and communication...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00163-8